OpenCL Based Parallel Algorithm for RBF-PUM Interpolation
نویسندگان
چکیده
منابع مشابه
OpenCL Based Parallel Algorithm for RBF-PUM Interpolation
We present a new parallel algorithm for multivariate RBF-PUM interpolation. • The nature of the PUM allows to deal with a large number of scattered data-points in high space dimensions. • Our algorithm makes use of shared-memory parallel processors through the OPENCL standard [3]. • This parallel strategy gives a linear computational time complexity with respect to the number of data-points. • ...
متن کاملA PUM interpolation algorithm using a cell-based searching procedure
In this paper we propose a fast algorithm for the bivariate interpolation of large scattered data sets. It is based on the Partition of Unity Method (PUM) [3] and involves radial basis functions as local approximants. The PUM algorithm is efficiently implemented and optimized by connecting the method itself with an effective cell-based searching procedure. More precisely, we construct a cell st...
متن کاملOpenCL Implementation of a Parallel Universal Kriging Algorithm for Massive Spatial Data Interpolation on Heterogeneous Systems
Fang Huang 1,2,*,†, Shuanshuan Bu 1,†, Jian Tao 3,*,† and Xicheng Tan 4,† 1 School of Resources & Environment, University of Electronic Science and Technology of China, 2006 Xiyuan Avenue, West Hi-Tech Zone, Chengdu 611731, China; [email protected] 2 Institute of Remote Sensing Big Data, Big Data Research Center, University of Electronic Science and Technology of China, 2006 Xiyuan Road, West...
متن کاملA Parallel Algorithm for Interval Polynomial Interpolation
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinations of interval nodes are used. The high computational complexity makes it necessary to perform the computation parallelly. In this paper, we report a parallel algorithm which effectively perform the combinatorical com...
متن کاملParallel Implementation of the Box Counting Algorithm in OpenCL
The Box Counting algorithm is a well-known method for the computation of the fractal dimension of an image. It is often implemented using a recursive subdivision of the image into a set of regular tiles or boxes. Parallel implementations often try to map the boxes to different compute units, and combine the results to get the total number of boxes intersecting a shape. This paper presents a nov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2017
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-017-0431-x